Toggle navigation
Home
About
About Journal
Historical Evolution
Indexed In
Awards
Reference Index
Editorial Board
Journal Online
Archive
Project Articles
Most Download Articles
Most Read Articles
Instruction
Contribution Column
Author Guidelines
Template
FAQ
Copyright Agreement
Expenses
Academic Integrity
Contact
Contact Us
Location Map
Subscription
Advertisement
中文
Journals
Publication Years
Keywords
Search within results
(((TANG Yiyuan[Author]) AND 1[Journal]) AND year[Order])
AND
OR
NOT
Title
Author
Institution
Keyword
Abstract
PACS
DOI
Please wait a minute...
For Selected:
Download Citations
EndNote
Ris
BibTeX
Toggle Thumbnails
Select
Improved ant colony optimization algorithm for path planning based on turning angle constraint
LI Kairong, LIU Shuang, HU Qianqian, TANG Yiyuan
Journal of Computer Applications 2021, 41 (
9
): 2560-2568. DOI:
10.11772/j.issn.1001-9081.2020111713
Abstract
(
338
)
PDF
(1445KB)(
385
)
Knowledge map
Save
Concerning the problems that basic Ant Colony Optimization (ACO) is easy to fall into the local optimum, and has too long path and excessive turning angles during path search, an improved ACO algorithm based on turning angle constraint was proposed. Firstly, the initial pheromone concentration of the area between the starting point and the target point was enhanced to avoid the initial blind search. Then, the A
*
algorithm's evaluation function and the turning angle constraint factor were added to the heuristic function. In this way, the node with the shortest path length and least number of turns was able to be selected at the next step. Finally, the distribution principle of wolf pack algorithm was introduced in the pheromone updating part to enhance the influence of high-quality population. At the same time, the Max and Min Ant System (MMAS) algorithm was used to limit the pheromone concentration to avoid the algorithm being trapped into the local optimum. Matlab simulation showed that compared with the traditional ACO, the improved algorithm was able to shorten the planned path length by 13.7%, reduce the number of turns by 64.3% and decrease the accumulated turning angle by 76.7%. Experimental results show that the improved ACO algorithm can effectively solve the global path planning problem and avoid the excessive energy loss of mobile robots.
Reference
|
Related Articles
|
Metrics
Select
Multi-purpose watermark algorithm for color image based on multiple transform domains
CHEN Shanxue, QI Ruolan, TANG Yiyuan
Journal of Computer Applications 2018, 38 (
8
): 2274-2279. DOI:
10.11772/j.issn.1001-9081.2018010158
Abstract
(
513
)
PDF
(1154KB)(
382
)
Knowledge map
Save
Concerning the single function of single watermark algorithm, a multi-purpose watermarking algorithm for color image combined with Discrete Wavelet Transform (DWT) and Quaternion Discrete Cosine Transform (QDCT) was proposed. Firstly, the DWT was applied to the three scrambled channels of a color image, and QDCT was applied to their low frequency subbands and medium frequency subbands, then some of the real coefficients were used to construct a coefficient matrix, and the robust watermark was embedded into the singular value of it by adding principle. Secondly, the image was divided into 2×2 sub-blocks and preprocessed with QDCT. The characteristic fragile watermark was generated by the low frequency modulus coefficients of QDCT and embedded into the Least Significant Bits (LSB) of the space domain. The experimental results show that the robust watermark has good robustness against JPEG compression, noise, contrast adjustment, cropping, rotating and hybrid attacks, and the fragile watermark is sensitive to tampering and has accurate tamper localization.
Reference
|
Related Articles
|
Metrics